PENYELESAIAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ANT COLONY SYSTEM (ACS)
نویسندگان
چکیده
منابع مشابه
Ant Colony Optimization and the Minimum Spanning Tree Problem
Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. In contrast to many successful applications, the theoretical found...
متن کاملAnt-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering
We have proposed an ant-based clustering algorithm for document clustering based on the travelling salesperson scenario. In this paper, we presented an approach called Ant-MST for gene expression data clustering based on both ant-based clustering and minimum spanning trees (MST). The ant-based clustering algorithm is firstly used to construct a fully connected network of nodes. Each node repres...
متن کاملHop-constrained Minimum Spanning Tree Problems in Nonlinear Cost Network Flows: an Ant Colony Optimization Approach
In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST) problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. We propose a hybrid heuristic, based on Ant Colony Optimization (ACO) and on Local Search (LS), to solve this class of problems given it...
متن کاملVariable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present two new approaches to solve this problem heuristically following the concepts of ant colony optimization (ACO) and variable neighborhood search (VNS). The...
متن کاملSolving the Minimum Label Spanning Tree Problem by Ant Colony Optimization
The Minimum Label Spanning Tree Problem is a well known combinatorial optimization problem, having applications in telecommunication network design and data compression. The problem is NP-hard and cannot be approximated within a constant factor. In this work we present the application of ant colony optimization to this problem. Different pheromone models and construction mechanisms are introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Komputa : Jurnal Ilmiah Komputer dan Informatika
سال: 2012
ISSN: 2715-7849,2089-9033
DOI: 10.34010/komputa.v1i2.59